Pān. Inian Linguistics
نویسنده
چکیده
1 Pān. ini’s grammar Pān. ini’s grammar (ca. 500 B.C.) seeks to provide a complete, maximally concise, and theoretically consistent analysis of Sanskrit grammatical structure. It is the foundation of all traditional and modern analyses of Sanskrit, as well as having great historical and theoretical interest in its own right. Western grammatical theory has been influenced by it at every stage of its development for the last two centuries. The early 19th century comparativists learned from it the principles of morphological analysis. Bloomfield modeled both his classic Algonquian grammars and the logical-positivist axiomatization of his Postulates on it. Modern linguistics acknowledges it as the most complete generative grammar of any language yet written, and continues to adopt technical ideas from it. The grammar is based on the spoken language (bhās . ā) of Pān. ini’s time, and also gives rules on Vedic usage and on regional variants. Its optional rules distinguish between preferable and marginal forms, and a few rules even have sociolinguistic conditions. It is entirely synchronic: variants are simply treated as alternate forms, indeed, the very concept of linguistic change is foreign to the tradition. The grammar consists of four components:
منابع مشابه
a-headers from the As.t.ādhyāyı̄ in Sanskrit literature from the perspective of corpus linguistics
The paper presents strategies for evaluating the influence of Pān. ini’s As.t.ādhyāyı̄ on the vocabulary of Sanskrit. Using a corpus linguistic approach, it examines how the Pān. inian sample words are distributed over post-Pān. inian Sanskrit, and if we can determine any lexicographic influence of the As.t.ādhyāyı̄ on later Sanskrit. The primary focus of the paper lies on data exploration, becau...
متن کاملTagging Classical Sanskrit Compounds
The paper sets out a prima facie case for the claim that the classification of Sanskrit compounds in Pān. inian tradition can be retrieved from a very slight augmentation of the usual enriched context free rules.
متن کاملSanskrit signs and Pān. inian scripts
We discuss ways of understanding the Pān. inian grammatical tradition of Sanskrit in computationally tractable ways. We propose to dissociate the formal expression of the locutor’s communicative intention (expressed as a composition of sign combinators called a script), from its justification (using Pān. inian rules and meta-rules). Computation consists then in evaluating a Pān. inian script to...
متن کاملModelling the Grammatical Circle of the Paninian System of Sanskrit Grammar
In the present article we briefly sketch an extended version of our previously developed model for computer representation of the Pān. inian system of Sanskrit grammar. We attempt to implement an antecedent analytical phase using heuristical methods and improve the subsequent phase of reconstitution using the rules of As.t .ādhyāȳı by incorporating strategies for automatic application of gramma...
متن کاملOn Panini and the Generative Capacity of Contextualized Replacement Systems
This paper re-examines the widely held belief that the formalism underlying the rule system propounded by the ancient Indian grammarian, Pān. ini (ca. 450–350 BCE), either anticipates or converges upon the same expressive power found in finite state control systems or the context-free languages that are used in programming language theory and computational linguistics. While there is indeed a s...
متن کامل